General Multiplicative Zagreb Indices of Graphs With Bridges
نویسندگان
چکیده
منابع مشابه
On multiplicative Zagreb indices of graphs
Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1 G and ( ) 2 G , under the name first and second multiplicative Zagreb index, respectively. These are define as ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...
متن کاملZagreb, multiplicative Zagreb Indices and Coindices of graphs
Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=sum_{uin V} d(u)^2, hspace {.1 cm} M_2(G)=sum_{uvin E} d(u).d(v)$ and $ M_3(G)=sum_{uvin E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second m...
متن کاملon multiplicative zagreb indices of graphs
todeschini et al. have recently suggested to consider multiplicative variants of additive graphinvariants, which applied to the zagreb indices would lead to the multiplicative zagrebindices of a graph g, denoted by ( ) 1 g and ( ) 2 g , under the name first and secondmultiplicative zagreb index, respectively. these are define as ( )21 ( ) ( )v v gg g d vand ( ) ( ) ( )( )2 g d v d v gu...
متن کاملzagreb, multiplicative zagreb indices and coindices of graphs
let g=(v,e) be a simple connected graph with vertex set v and edge set e. the first, second and third zagreb indices of g are respectivly defined by: $m_1(g)=sum_{uin v} d(u)^2, hspace {.1 cm} m_2(g)=sum_{uvin e} d(u).d(v)$ and $ m_3(g)=sum_{uvin e}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in g and uv is an edge of g connecting the vertices u and v. recently, the first and second m...
متن کاملCertain General Zagreb Indices and Zagreb Polynomials of Molecular Graphs
Chemical compounds and drugs are often modelled as graphs where each vertex represents an atom of molecule, and covalent bounds between atoms are represented by edges between the corresponding vertices. This graph derived from a chemical compounds is often called its molecular graph, and can be different structures. In this paper, by virtue of mathematical derivation, we determine the fourth, f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3005040